A Hilton-Milner Theorem for Vector Spaces
نویسندگان
چکیده
We show for k ≥ 3 that if q ≥ 3, n ≥ 2k + 1 or q = 2, n ≥ 2k + 2, then any intersecting family F of k-subspaces of an n-dimensional vector space over GF (q) with ⋂ F∈F F = 0 has size at most [ n−1 k−1 ] − qk(k−1) [ n−k−1 k−1 ] +qk. This bound is sharp as is shown by Hilton-Milner type families. As an application of this result, we determine the chromatic number of the corresponding q-Kneser graphs.
منابع مشابه
Vector ultrametric spaces and a fixed point theorem for correspondences
In this paper, vector ultrametric spaces are introduced and a fixed point theorem is given for correspondences. Our main result generalizes a known theorem in ordinary ultrametric spaces.
متن کاملFan-KKM Theorem in Minimal Vector Spaces and its Applications
In this paper, after reviewing some results in minimal space, some new results in this setting are given. We prove a generalized form of the Fan-KKM typetheorem in minimal vector spaces. As some applications, the open type of matching theorem and generalized form of the classical KKM theorem in minimal vector spaces are given.
متن کاملOn intermediate value theorem in ordered Banach spaces for noncompact and discontinuous mappings
In this paper, a vector version of the intermediate value theorem is established. The main theorem of this article can be considered as an improvement of the main results have been appeared in [textit{On fixed point theorems for monotone increasing vector valued mappings via scalarizing}, Positivity, 19 (2) (2015) 333-340] with containing the uniqueness, convergent of each iteration to the fixe...
متن کاملA degree version of the Hilton-Milner theorem
An intersecting family of sets is trivial if all of its members share a common element. Hilton and Milner proved a strong stability result for the celebrated Erdős–Ko–Rado theorem: when n > 2k, every non-trivial intersecting family of k-subsets of [n] has at most (n−1 k−1 ) − (n−k−1 k−1 ) + 1 members. One extremal family HMn,k consists of a k-set S and all k-subsets of [n] containing a fixed el...
متن کاملErdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets
We prove Erdős-Ko-Rado and Hilton-Milner type theorems for t-intersecting k-chains in posets using the kernel method. These results are common generalizations of the original EKR and HM theorems, and our earlier results for intersecting k-chains in the Boolean algebra. For intersecting k-chains in the c-truncated Boolean algebra we also prove an exact EKR theorem (for all n) using the shift met...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010